Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Influence maximization algorithm on internal decay based on community structure in social network
SUN Zili, PENG Jian, TONG Bo
Journal of Computer Applications    2019, 39 (3): 834-838.   DOI: 10.11772/j.issn.1001-9081.2018081695
Abstract452)      PDF (837KB)(265)       Save

The existing network spread model ignores the information attenuation in the process of information spread, and the traditional influence maximization algorithm cannot effectively use the community structure to improve the influence spread range. To solve these problems, an algorithm of Influence Maximization on Internal Decay (IMID) based on community structure was proposed. Firstly, the community structure of a whole social network was divided and the influence range of nodes in the community was evaluated. Then, with spread probability of association points between the communities considered, the attenuation degree of information spread between nodes was calculated. Experimental and analysis results show that the proposed algorithm not only reduces the time complexity, but also obtains the influence transmission range near that of greedy algorithm, with influence coverage over 90%. Therefore, with several nodes selected as the initial nodes between the core seed node set and connected communities, information will be widely spread in the network at the minimum cost.

Reference | Related Articles | Metrics
Airline predicting algorithm based on improved Markov chain
WANG Zhongqiang, CHEN Jide, PENG Jian, HUANG Feihu, TONG Bo
Journal of Computer Applications    2017, 37 (7): 2124-2128.   DOI: 10.11772/j.issn.1001-9081.2017.07.2124
Abstract625)      PDF (756KB)(433)       Save
In the transportation field, analyzing passengers' travel destinations brings a lot of commercial value. However, research on the passengers' travel destinations is difficult because of its uncertainty. In order to solve this problem, in existing studies, entropy is used to measure the uncertainty of human mobility to describe individuals' travel features, and the spatiotemporal correlation of individual trajectories is taken into account simultaneously, which can not achieve the desired accuracy. Therefore, an algorithm for airline prediction based on improved Markov chain was proposed to predict passengers' travel destinations. First, the distance distribution, site distribution and temporal regularity on history records of passengers' travels were analyzed. Then, the dependence of human mobility on historical behavior and current location was analyzed. Finally, the characteristics of passengers' permanent residence and the exploration probability of new airlines were added into the calculation transition matrix, and an algorithm based on improved Markov chain was proposed and realized to predict passengers' next travels. The experimental results show that the average prediction accuracy of the proposed model can reach 66.4%. Applying in the field of customer travel analysis, airline company can benefit from the research to predict passenger travel better and provide personalized travel services.
Reference | Related Articles | Metrics